Consistency between ordering and clustering methods for graphs

A relational dataset is often analyzed by optimally assigning a label to each element through clustering or ordering. While similar characterizations of would be achieved both and ordering methods, the former has been studied much more actively than latter, particularly for data represented as graphs. This study fills this gap investigating methodological relationships between several focusing on spectral techniques. Furthermore, we evaluate resulting performance methods. To end, propose measure called continuity error, which generically quantifies degree consistency sequence partition set elements. Based synthetic real-world datasets, extents an method identifies module structure banded structure.